String bits and the Myers effect
نویسنده
چکیده
Based on the non-abelian effective action for D1-branes, a new action for matrix string theory in non-trivial backgrounds is proposed. Once the background fields are included, new interactions bring the possibility of non-commutative solutions i.e. The Myers effect for “string bits” .
منابع مشابه
Hardwar Trojan classification and implementation and offer a new detection approach
A hardware attack that enables the attacker to alter the main circuit with malicious hardware during either design or the fabrication process is studied and analyzed. This attack, known as the hardware Trojan, has different objectives such as destroying hardware, changing circuit characteristics or extracting sensitive information. So hardware Trojan detection and hardware security are critical...
متن کاملThe Effect of Sucking Ice Bits on Nausea and Vomiting During Chemotherapy in Patients with Breast Cancer
Objective Cancer disease and its treatment methods affect the quality of life of those suffering from breast cancer. Nausea and vomiting are frequent side-effects of chemotherapy. Nowadays, complementary therapies are used along with routine treatments to control this disease. This study aimed to evaluate the effect of sucking ice bits with plain water on nausea and vomiting during chemotherapy...
متن کاملar X iv : h ep - t h / 03 07 25 3 v 2 2 6 N ov 2 00 3 Can string bits be supersymmetric ?
We search for the possibility to have supersymmetric string bits at finite discretization J . From a general setup we find that the string bits can be made supersymmetric modulo a single defect mode which is not expected to have any sensible effect in the continuum limit.
متن کاملh / 03 07 25 3 v 1 2 5 Ju l 2 00 3 Can string bits be supersymmetric ?
We search for the possibility to have supersymmetric string bits at finite discretization J . From a general setup we find that the string bits can be made supersymmetric modulo a single defect mode which is not expected to have any sensible effect in the continuum limit.
متن کاملExplaining and Extending the Bit-parallel Approximate String Matching Algorithm of Myers
The O( mn / w), where m is pattern length, n is text length and w is the computer word size, bit-parallel algorithm of Myers [6] is one of the best current algorithms in the case of approximate string matching allowing insertions, deletions and substitutions. We begin this paper by deriving a practically equivalent version of the algorithm of Myers. This is done in a way, which we believe makes...
متن کامل